Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems
نویسندگان
چکیده
<p style='text-indent:20px;'>Tensor eigenvalue complementary problems, as a special class of are the generalization matrix problems in higher-order. In recent years, tensor complementarity have been studied extensively. The research fields mainly focus on analysis theory and algorithms. this paper, we investigate solution method for four kinds with different structures. By utilizing an equivalence relation to unconstrained optimization propose modified spectral PRP conjugate gradient solve problems. Under mild conditions, global convergence given is also established. Finally, give related numerical experiments results compared inexact Levenberg-Marquardt method, show efficiency proposed verify our theoretical results.</p>
منابع مشابه
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملA New Smoothing Conjugate Gradient Method for Solving Nonlinear Nonsmooth Complementarity Problems
In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjugate gradient method for solving the nonlinear nonsmooth complementarity problems. The line search which we used guarantees the descent of the method. Under suitable conditions, the new smoothing conjugate gradient method is proved globally convergent. Finally, preliminary numerical experiments sh...
متن کاملConjugate gradient predictor corrector method for solving large scale problems
In this paper, we give a new method for solving large scale problems. The basic idea of this method depends on implementing the conjugate gradient as a corrector into a continuation method. We use the Euler method as a predictor. Adaptive steplength control is used during the tracing of the solution curve. We present some of our experimental examples to demonstrate the efficiency of the method.
متن کاملGlobal convergence of a modified spectral FR conjugate gradient method
A modified spectral PRP conjugate gradient method is presented for solving unconstrained optimization problems. The constructed search direction is proved to be a sufficiently descent direction of the objective function. With an Armijo-type line search to determinate the step length, a new spectral PRP conjugate algorithm is developed. Under some mild conditions, the theory of global convergenc...
متن کاملA semismooth Newton method for tensor eigenvalue complementarity problem
In this paper, we consider the tensor eigenvalue complementarity problem which is closely related to the optimality conditions for polynomial optimization, as well as a class of differential inclusions with nonconvex processes. By introducing an NCP-function, we reformulate the tensor eigenvalue complementarity problem as a system of nonlinear equations. We show that this function is strongly s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2022
ISSN: ['1547-5816', '1553-166X']
DOI: https://doi.org/10.3934/jimo.2020147